Fundamental Properties of Valuation Theory and Hensel's Lemma
نویسنده
چکیده
Convergence with respect to a valuation is discussed as convergence of a Cauchy sequence. Cauchy sequences of polynomials are defined. They are used to formalize Hensel’s lemma.
منابع مشابه
An Approach to Hensel's Lemma
Hensel's Lemma is an important tool in many ways. One application is in factoring polynomials over Z. The computation in applying Hensel's Lemma proceeds by using the Euclidean algorithm. In this short article we present another approach to Hensel's Lemma, and we show that the lift of a polynomial can be calculated in another way. In some cases this is computationally faster. The proof is a con...
متن کاملFactoring a Multiprime Modulus N with Random Bits
In 2009, Heninger and Shacham presented an algorithm using the Hensel's lemma for reconstructing the prime factors of the modulus N = r1r2. This algorithm computes the prime factors of N in polynomial time, with high probability, assuming that a fraction greater than or equal to 59% random bits of its primes r1 and r2 is given. In this paper, we present the analysis of Hensel's lemma for a mult...
متن کاملFractional Probability Measure and Its Properties
Based on recent studies by Guy Jumarie [1] which defines probability density of fractional order and fractional moments by using fractional calculus (fractional derivatives and fractional integration), this study expands the concept of probability density of fractional order by defining the fractional probability measure, which leads to a fractional probability theory parallel to the classical ...
متن کاملA simple proof of Zariski's Lemma
Our aim in this very short note is to show that the proof of the following well-known fundamental lemma of Zariski follows from an argument similar to the proof of the fact that the rational field $mathbb{Q}$ is not a finitely generated $mathbb{Z}$-algebra.
متن کاملModels for Quantitative Distributed Systems and Multi-Valued Logics
We investigate weighted asynchronous cellular automata with weights in valuation monoids. These automata form a distributed extension of weighted finite automata and allow us to model concurrency. Valuation monoids are abstract weight structures that include semirings and (non-distributive) bounded lattices but also offer the possibility to model average behaviors. We prove that weighted asynch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Archive of Formal Proofs
دوره 2007 شماره
صفحات -
تاریخ انتشار 2007